home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- Path: watserv3.uwaterloo.ca!news
- From: bcrwhims@uwaterloo.ca (Carsten Whimster)
- Subject: Re: Algorithms needed
- Message-ID: <DovM4J.LE4@watserv3.uwaterloo.ca>
- Sender: news@watserv3.uwaterloo.ca
- Nntp-Posting-Host: cnts5p15.uwaterloo.ca
- Reply-To: carsten_whimster@iqpac.com (Carsten Whimster)
- Organization: EDM/2
- X-Newsreader: IBM NewsReader/2 v1.2.5
- References: <4j8jf9$1kr@styx.uwa.edu.au>
- Date: Tue, 26 Mar 1996 13:14:43 GMT
-
- In <4j8jf9$1kr@styx.uwa.edu.au>, fechin@tartarus.uwa.edu.au (Paul McCormick) writes:
- >I am doing a project and need source code for the following clasic problems.
- >Any language is fine but c or c++ is preferred.
- >
- >Problems.
- >
- >1)write a approximation algorithm for the TRAVILING SALESMAN problem
- >assume that triangle inequality is satisfied and a adjacency matrix is
- >used.
- >The program will only be allowed 400 seconds of CPU time to come up with
- >the closest solution.
- >
- >2)Write a recursive search program that finds th HAMILTONIAN CYCLE of a
- >graph
- >
- >3)Write a program that finds the diameter of a graph using BFS
- >algorithm.
- >
- >If you have any solutions please mail them to me at
- >fechin@tartarus.uwa.edu.au
-
- If I knew the e-mail address of your prof, I would mail this straight to
- him. Do you want to learn or do you just want to cheat your way through
- school? I can't stand people like you, always asking me to help them out
- by giving them solutions they never had to think about.
-
- Carsten
-
-